J.kDenzinger T.kMatsui D.kGrosu K.kHirayama M.kYokoo M.kZanker 1 2 5 3 6 4 4 4
نویسندگان
چکیده
In this study, we introduce a new peer-to-peer (P2P) approach to instant messaging systems based on a fully decentralized network, and where each human owning a peer can control the traffic supported by her system. The control may be based on criteria such as: (a) her desire to help the endpoints of the communication, e.g., based on friendship, (b) her desire to help a cause, e.g., based on the content/topic of the communication, (c) reputation, or (d) the utility brought to her by the handled data. Peers need help to communicate when they are behind NATs. Unlike the P2P chat system used in Skype, no centralized servers are involved (no central redirect server, login server or web server). Providing intrinsic motivation such that peers help with traffic is important in order to eventually make an open source P2P chat system viable. In current non-incentive P2P systems like Skype, availability of open source versions can potentially starve the system of supernodes (since users can disable the resource consuming supernode-function). In our approach, each peer has equal privileges to any other peer. Nodes register their address with other peers of their choice, which can then act as directories on their behalf. Each peer with sufficient resources can voluntarily play the role of directory for her friends or of forwarding incoming messages to peers behind NATs. This paper analyzes key functions of the solution such as incentive management, NAT and firewall traversal, connection establishment and message transfer under different network setups. Introduction Instant messaging has been one of the most successful applications on the Internet, starting with talk and IRC to Twitter and Facebook. One of the most currently used such systems, Skype, is a peer-to-peer (P2P) application. The P2P architecture offers Skype significant robustness and scalability, as well as efficiency, particularly from the perspective of a low latency. Besides depending on a centralized set of login servers that could be used to eventually bring down the whole system, Skype is a closed source software, and it is known to use computational resources of unsuspecting users. While efforts to build open source clients have failed due to secret changes in protocols (Baset & Schulzrinne 2004; 2006; Guha, Daswani, & Jain 2006), it is questionable whether they could in fact survive when the protocol would be open. The issue is that, with open source software, the users can get versions that disable expensive super-node functions that exploit the resources of the nodes. This missing property is called faithfulness (Shneidman, Parkes, & Massoulié 2004). In the closed source chat systems, the only incentive to act as supernode is the fact that binaries do not allow users to disable that function selectively. Since current protocols have no intrinsic incentives to voluntarily act as a supernode, availability of an open source agent can starve the network of super-nodes and lead to the demise of the service. We propose an approach to P2P supernodes that can simultaneously offer advantages similar to Skype, while being fully decentralized, open source, allowing customization and control of one’s resources. Users may thereby enforce that their resources are used only for causes that they want to support. Providing intrinsic incentives for peers to help with traffic flow in P2P network applications is important in order to overcome the most common problems with the open-source P2P paradigm: Free-riding and tragedy of the commons (Ma et al. 2003). Incentives are intrinsic to an application if the participant loses by not performing the actions expected of her due to those actions, and not due to benefits provided separately (e.g., bundled in a pre-compiled software). Incentives To encourage peers to support the chat communication of others, the proposed protocol enables incentives, such as: • Ability to control the traffic passing by her system: – helping the endpoints of the communication (e.g., based on friendship or subject). – rejecting the endpoints of the communication (e.g., based on disagreement). • Getting information concerning who talks to whom and what are they talking about (for research, marketing data or pure curiosity). • Supporting open source P2P chat systems, thereby supporting the freedom of customization. • Opportunity to insert advertisements into the stream. • Ability to offer paid services for supporting the communication. The characteristics of our P2P approach is: network address translation (NAT) piercing ability, democracy, no outside control, full decentralization. In the next section we discuss differences with related work. After introducing the main concepts, section Protocol describes in detail the mechanism used by peers for incentive chat.
منابع مشابه
Supplement to Internally 4-connected projective-planar graphs
A5 = {{1, 2}, {1, 3}, {1, 4}, {1, 5}, {2, 3}, {2, 4}, {2, 5}, {3, 4}, {3, 5}, {4, 5}, {6, 7}, {6, 8}, {6, 9}, {6, 10}, {7, 8}, {7, 9}, {7, 10}, {8, 9}, {8, 10}, {9, 10}} C11 = {{1, 2}, {1, 3}, {1, 4}, {1, 5}, {2, 3}, {2, 4}, {2, 5}, {3, 4}, {3, 5}, {4, 5}, {6, 9}, {6, 10}, {6, 11}, {7, 9}, {7, 10}, {7, 11}, {8, 9}, {8, 10}, {8, 11}} E42 = {{1, 4}, {1, 5}, {1, 6}, {2, 4}, {2, 5}, {2, 6}, {3, 4},...
متن کاملAdditional file 5.xlsx
position -4 C50 C49 C48 C47 C46 C45 C44 C43 C42 C41 C40 C39 C38 C37 C36 C35 C34 C33 C32 C31 C30 C29 C28 C27 C26 C25 C24 C23 C22 C21 C20 C19 C18 C17 C16 C15 C14 C13 C12 C11 C10 C9 C8 C7 C6 C5 C4 C3 C2 C1 C0 C-index SD P-value mark A 5 7 9 1 8 4 6 2 1 4 8 7 6 9 3 4 3 7 15 10 6 6 9 3 2 5 3 6 8 9 6 3 5 7 7 10 4 7 7 8 5 5 8 2 2 3 1 2 5 5 9 0.618 0.317 8.27E-03 n.s. A C 3 1 2 0 2 3 3 1 1 2 1 7 4 9 1 ...
متن کاملAntibiotic Susceptibility of Salmonellosis Pathogens
Results 2 1 ) -. $%%& 7 ) " . ( 4 $5 ( 6 *1 )%( & ( 6 + ) ( 3 6 ) " ( '3 6 ) ( (5 ' ( 6 *1 )%( $ ( 6 + ) 8 ( (5 6 2 1 ) -. '((& ) ( '3 93$' 6 *1 )%( -' ( 6 + ) 4 ( 3 4 $ ( 6 *1 )%( $ ( 6 + 2 1 ) '& $%%& 7 ) " $ ( 4 ' ( 6 *1 )%( ' ( 6 + ) 4 ( (5 ( '3 6 *1 )%( ( ('3 6 + ) " 4 ( $'3 6 ) 4 ( (5 ' ( 6 *1 )%( $ ( 6 + ) 8 ( (5 6 2 1 ) '. '((& 7 ) " ' ( 4 & ( 6 *1 )%( . ( 6 + ) 4 $ ( 4 ' ( 6 *1 )%( ' (...
متن کاملWork supported in part by US Department of Energy contract DE-AC02-76SF00515
! " " # $$ $ " ! $$ ! # ! " ## !$ % & ' ( ) * + #, + $ * ./ / , 0 1 . 2 ) " ( '. & 3 # ( + , , % ! ( #/ " ## " + " ## +, 4 $ $ 2 4 5/. 2 % 5, $ ) 2 1 , 0 / . 2 0 . 2 $ 2 + / , 2 & ,. 2 " $ / % + .)/ .6 " " $. " # % # . ( #* 3 / 7 1 ! " # ! 8 , * * ! " ( ! % + 2 $ ./ % 4 ,* " ( , + ) ! 3 .* " # 5 , $. , ** 1 3 # * ( , ! % % $$ , % ( #$ 1 !* !. $. $ 7 # 4 . # 4 " % ) 2 " $$ " ' " % . $ 9 $ * 3 7 ...
متن کاملA new result on the problem of Buratti, Horak and Rosa
(a, b, c, d) r{1, 2, 3, 5} (0, 2v + 4, 1, 2) [0, . . . , 2v, 2v + 5, 2v + 7, 2v + 2, 2v + 4, 2v + 6, 2v + 3, . . . , 1] (0, 2v + 5, 1, 2) [0, . . . , 2v + 4, 2v + 7, 2v + 5, 2v + 3, 2v + 8, 2v + 6, 2v + 1, . . . , 1] (0, 2v + 3, 2, 1) [0, . . . , 2v, 2v + 5, 2v + 2, 2v + 4, 2v + 6, 2v + 3, . . . , 1] (0, 2v + 4, 2, 1) [0, . . . , 2v + 2, 2v + 7, 2v + 5, 2v + 3, 2v + 6, 2v + 4, 2v + 1, . . . , 1...
متن کامل